منابع مشابه
The maximum node clustering problem
In this paper we introduce a graph problem, called Maximum Node Clustering (MNC). We prove that the problem is strongly NP -complete and show that it can be approximated in polynomial time within a ratio arbitrarily close to 2. For the special case where the graph is a tree, we prove that the problem is weakly NP -complete as it generalizes the 0/1 Knapsack problem and is solvable in pseudopoly...
متن کاملA Scaling Algorithm for the Maximum Node-Capacitated Multiflow Problem
We study the problem of finding a fractional node-capacitated multiflow of maximum value in an undirected network. Previously known methods for this problem are based on linear programming and the ellipsoid method. In this paper we apply a capacity scaling approach and develop a purely combinatorial weakly polynomial algorithm of time complexity O(Λ(n, m, U) n log n log U), where n, m, U are th...
متن کاملThe Rooted Maximum Node-Weight Connected Subgraph Problem
Given a connected node-weighted (di)graph, with a root node r, and a (possibly empty) set of nodes R, the Rooted Maximum NodeWeight Connected Subgraph Problem (RMWCS) is the problem of finding a connected subgraph rooted at r that connects all nodes in R with maximum total weight. In this paper we consider the RMWCS as well as its budget-constrained version, in which also non-negative costs of ...
متن کاملFuzzy Particle Swarm Optimization Algorithm for a Supplier Clustering Problem
This paper presents a fuzzy decision-making approach to deal with a clustering supplier problem in a supply chain system. During recent years, determining suitable suppliers in the supply chain has become a key strategic consideration. However, the nature of these decisions is usually complex and unstructured. In general, many quantitative and qualitative factors, such as quality, price, and fl...
متن کاملMaximum-Bandwidth Node-Disjoint Paths
This paper presents a new method for finding the node-disjoint paths with maximum combined bandwidth in communication networks. This problem is an NP-complete problem which can be optimally solved in exponential time using integer linear programming (ILP). The presented method uses a maximum-cost variant of Dijkstra algorithm and a virtual-node representation to obtain the maximum-bandwidth nod...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Combinatorial Optimization
سال: 2006
ISSN: 1382-6905,1573-2886
DOI: 10.1007/s10878-006-8210-x